منابع مشابه
Most balanced minimum cuts and partially ordered knapsack
We consider the problem of finding most balanced cuts among minimum st-edge cuts and minimum st-vertex cuts, for given vertices s and t, according to different balance criteria. For edge cuts [S, S] we seek to maximize min{|S|, |S|}. For vertex cuts C of G we consider the objectives of (i) maximizing min{|S|, |T |}, where {S, T} is a partition of V (G)\C with s ∈ S, t ∈ T and [S, T ] = ∅, (ii) ...
متن کاملMinimum Cuts
1 Minimum Cuts In this lecture we will describe an algorithm that computes the minimum cut (or simply mincut) in an undirected graph. A cut is deened as follows.
متن کاملAlgorithm for Minimum Cuts
A minimum cut is a set of edges of minimum weight whose removal disconnects a given graph. Minimum cut algorithms historically applied duality with maximum ows and thus had the same (mn) running time as maximum ow algorithms. More recent algorithms which are not based on maximum ows also require (mn) time. In this paper, we present the rst algorithm that breaks the (mn) \max-ow barrier" for ndi...
متن کاملMaximum Flows and Minimum Cuts
In the mid-1950s, U. S. Air Force researcher Theodore E. Harris and retired U. S. Army general Frank S. Ross published a classified report studying the rail network that linked the Soviet Union to its satellite countries in Eastern Europe. The network was modeled as a graph with 44 vertices, representing geographic regions, and 105 edges, representing links between those regions in the rail net...
متن کاملComputing minimum cuts in hypergraphs
We study algorithmic and structural aspects of connectivity in hypergraphs. Given a hypergraph H = (V, E) with n= |V |, m= |E| and p = ∑ e∈E |e| the fastest known algorithm to compute a global minimum cut in H runs in O(np) time for the uncapacitated case, and in O(np+ n2 log n) time for the capacitated case. We show the following new results. • Given an uncapacitated hypergraph H and an intege...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2010
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.09.010